The low-complexity jump counting pattern
Bookreader Item Preview
Share or Embed This Item
- Publication date
- 2023-05-25
- Usage
- Attribution-NoDerivs 4.0 International



- Topics
- algorithm, skip field, element skipping, constant time, programming
- Collection
- opensource
- Language
- English
- Item Size
- 13.4M
The low complexity jump-counting pattern is a replacement for boolean skip-fields which enables O(1) time complexity for iteration from one unskipped object to the next.
- Addeddate
- 2023-11-24 02:32:15
- Identifier
- matt_bentley_-_the_low_complexity_jump-counting_pattern
- Identifier-ark
- ark:/13960/s2tqwq8zw5n
- Ocr
- tesseract 5.3.0-6-g76ae
- Ocr_detected_lang
- en
- Ocr_detected_lang_conf
- 1.0000
- Ocr_detected_script
- Latin
- Ocr_detected_script_conf
- 1.0000
- Ocr_module_version
- 0.0.21
- Ocr_parameters
- -l eng
- Page_number_confidence
- 18
- Page_number_module_version
- 1.0.3
- Pages
- 29
- Ppi
- 300
- Scanner
- Internet Archive HTML5 Uploader 1.7.0
comment
Reviews
119 Views
DOWNLOAD OPTIONS
For users with print-disabilities
IN COLLECTIONS
Community TextsUploaded by mattbentley on
Open Library